The Existence of DNR ( mt + 1 , m , m − 1 ) - BIBDs

Doubly near resolvable m-cycle systems

An m-cycle system C of λKn is said to be near resolvable if the mcycles in C can be partitioned into near parallel classes R1, R2, . . . , Rλn/2, each one of which is a 2-factor of λKn − v for some vertex v in λKn. If an NR(n,m, λ)-CS has a pair of orthogonal resolutions, it is said to be doubly resolvable and is denoted by DNR(n,m, λ)-CS. For m = 2, 3, DNR(n,m, 2)-CSs are known as Room frames ...

Existence of doubly near resolvable (v, 4, 3) BIBDs

The existence of doubly near resolvable (v, 2, 1)-BIBDs was established by Mullin and Wallis in 1975. For doubly near resolvable (v, 3, 2)-BIBDs, the existence problem was investigated by Lamken in 1994, and completed by Abel, Lamken and Wang in 2007. In this paper, we look at doubly near resolvable (v, 4, 3)-BIBDs; we establish that these exist whenever v ≡ 1 (mod 4) except for v = 9 and possi...

On the Existence of (v, 5, 1)-BIBDs

Existence of near resolvable (v, k, k-1) BIBDs with k∈{9, 12, 16}

A necessary condition for existence of a (v, k, k−1) near resolvable BIBD is v ≡ 1 (mod k). In this paper, we update earlier known existence results when k ∈ {9, 12, 16}, and show this necessary condition is sufficient, except possibly for 26, 37 and 149 values of v for k = 9, 12, 16 respectively. Some new results for existence of (9, 8)-frames of type 9 are also obtained; in particular, we sho...

Classes of block designs and theirs application in the analysis of agricultural experiment organization

With the design B(v,r_1,...,r_v,b,k_1,...,k_b,λ{12},...,λ{v-1,v}),like one combinatorial configuration, can be presented organization of one experiment in which participate finite number v different elements some basic set V, which should organise in the b designs each with defined number k_j (j=1,...,v) elements from this basic set, but so that every of this elements are exactly in ri (i=1,......